Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas
نویسندگان
چکیده
منابع مشابه
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas
1Department of Computing, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK 2Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK 3Department of Computer Science, King’s College London, Strand, London WC2R 2LS, UK 4School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex UB8 3PH, UK 5@UK PLC, 5 Jupiter House, ...
متن کاملCharacterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. As defined in this paper, a slice of a schema is obtained from a schema by deleting some of its statements. We prove that given a schema S which is functionlin...
متن کاملCharacterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. A subschema of a schema is obtained from a schema by deleting some of its statements. We prove that given a schema S which is predicate-linear, free and libera...
متن کاملA Parallel Algorithm for Static Program Slicing
Program slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the parallel slicing algorithm is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of Weiser’s original static slicing...
متن کاملA Parallel Algorithm for Static Program Slicing
Program Slicing is the process of deleting statements in a program that do not affect a given set of variables at a chosen point in the program. In this paper the first parallel slicing algorithm for static program slicing is introduced. It is shown how the control flow graph of the program to be sliced is converted into a network of concurrent processes, thereby producing a parallel version of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2005
ISSN: 1460-2067,0010-4620
DOI: 10.1093/comjnl/bxh121